Limited-Magnitude Error-Correcting Gray Codes for Rank Modulation
نویسندگان
چکیده
منابع مشابه
Erratum to: Linear covering codes and error-correcting codes for limited-magnitude errors
The expression for ω 2,2,r (2t) in Theorem 9 is misprinted in the original publication of this article. It should have been the same as for ω 2,1,r (2t) in Theorem 11. The correct expression in Theorem 9 will be Theorem 9 For q = 2t where t is odd, we have ω 2,2,r (2t) = 1 2 (2 r − 1)(t r + 1) .
متن کاملLinear covering codes and error-correcting codes for limited-magnitude errors
The concepts of a linear covering code and a covering set for the limitedmagnitude-error channel are introduced. A number of covering-set constructions, as well as some bounds, are given. In particular, optimal constructions are given for some cases involving small-magnitude errors. A problem of Stein is partially solved for these cases. Optimal packing sets and the corresponding error-correcti...
متن کاملError-correcting codes on low rank surfaces
In this paper we construct some algebraic geometric error-correcting codes on surfaces whose Neron-Severi group has low rank. If the rank of the Neron-Severi group is 1, the intersection of this surface with an irreducible surface of lower degree will be an irreducible curve, and this makes possible the construction of codes with good parameters. Rank 1 surfaces are not easy to find, but we are...
متن کاملError-correcting two-dimensional modulation codes
Modulation coding, to limit the number of consecutive zeroes in a data stream, is essential in digital magnetic recording/playback systems. Additionally, such sys tems require error correction coding to ensure that the decoded output matches the recorder input, even if noise is present. Typically these two coding steps have been performed independently, although various methods of combining th...
متن کاملSome codes correcting single symmetric errors of limited magnitude
An error model with symmetric errors of limited magnitude is considered. Limited magnitude means that the size of any error is limited by a number smaller (usually much smaller) than the alphabet size. Several constructions of codes correcting single error are given. In some cases, the codes are perfect or quasi-perfect.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2017
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2017.2719710